Thrifty Generic Broadcast
نویسندگان
چکیده
We consider the problem of generic broadcast in asynchronous systems with crashes a problem that was rst studied in Roughly speaking given a con ict relation on the set of messages generic broad cast ensures that any two messages that con ict are delivered in the same order messages that do not con ict may be delivered in di erent order In this paper we de ne what it means for an implementation generic broadcast to be thrifty and give corresponding implementations that are optimal in terms of resiliency We also give an interesting application of our results regarding the implementation of atomic broadcast
منابع مشابه
Generic Broadcast
Message ordering is a fundamental abstraction in distributed systems. However, usual ordering guarantees are purely “syntactic”, that is, message “semantics” is not taken into consideration, despite the fact that in several cases, semantic information about messages leads to more efficient message ordering protocols. In this paper we define the Generic Broadcast problem, which orders the delive...
متن کاملInsights from the developing world: thrifty genotypes and thrifty phenotypes.
Few researchers would dispute that the pandemic of obesity is caused by a profound mismatch between humanity's present environmental circumstances and those that have moulded evolutionary selection. This concept was first articulated when gestational diabetes was described as being the result of a 'thrifty genotype rendered detrimental by progress'. More recently, this hypothesis has been exten...
متن کاملCan Thrifty Gene(s) or Predictive Fetal Programming for Thriftiness Lead to Obesity?
Obesity and related disorders are thought to have their roots in metabolic "thriftiness" that evolved to combat periodic starvation. The association of low birth weight with obesity in later life caused a shift in the concept from thrifty gene to thrifty phenotype or anticipatory fetal programming. The assumption of thriftiness is implicit in obesity research. We examine here, with the help of ...
متن کاملOn the Inherent Cost of Generic Broadcast
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no failures can be tolerated, (b) to deliver messages in two rounds, at most f < n/3 failures can be tolerated, where n is the number of processes in the system, and (c) to deliver messages in three rounds, at most f < n...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کامل